Approximate Seriation Problem in Formal Context Analysis
نویسندگان
چکیده
In this paper we present a method (linear in the size of the formal context) to solve the seriation problem for formal contexts. We show that any maximal solution can be represented by a PQ-Tree. Moreover, the set of PQ-Trees can be seen as a distributive lattice. This lattice yields a consensus method which deals with the multiple solutions.
منابع مشابه
Getting Things in Order: An Introduction to the R package seriation
Seriation, i.e., finding a linear order for a set of objects given data and a loss or merit function, is a basic problem in data analysis. Caused by the problem’s combinatorial nature, it is hard to solve for all but very small sets. Nevertheless, both exact solution methods and heuristics are available. In this paper we present the package seriation which provides the infrastructure for seriat...
متن کاملConvex Relaxations for Permutation Problems
Seriation seeks to reconstruct a linear order between variables using unsorted, pairwise similarity information. It has direct applications in archeology and shotgun gene sequencing, for example. We write seriation as an optimization problem by proving the equivalence between the seriation and combinatorial 2-SUM problems on similarity matrices (2-SUM is a quadratic minimization problem over pe...
متن کاملNew results in cutting seriation for approximate #SAT
The general problem discussed here concerns the approximation of the number of solutions of a boolean formula in conjunctive normal form F . Results previously obtained (Rouat (1999), Lerman and Rouat (1999)) are reconsidered and completed. Our method is based on the general principle “divide to resolve”. The division is achieved by cutting a seriation built on an incidence data table associate...
متن کاملAn experimental comparison of seriation methods for one-mode two-way data
Seriation aims at finding a linear order for a set of objects to reveal structural information which can be used for deriving data-driven decisions. It presents a difficult combinatorial optimization problem with its roots and applications in many fields including operations research. This paper focuses on a popular seriation problem which tries to find an order for a single set of objects that...
متن کاملCombinatorial Structure of the Deterministic Seriation Method with Multiple Subset Solutions
Seriation methods order a set of descriptions given some criterion (e.g., unimodality or minimum distance between similarity scores). Seriation is thus inherently a problem of finding the optimal solution among a set of permutations of objects. In this short technical note, we review the combinatorial structure of the classical seriation problem, which seeks a single solution out of a set of ob...
متن کامل